368 research outputs found
The Combinatorial World (of Auctions) According to GARP
Revealed preference techniques are used to test whether a data set is
compatible with rational behaviour. They are also incorporated as constraints
in mechanism design to encourage truthful behaviour in applications such as
combinatorial auctions. In the auction setting, we present an efficient
combinatorial algorithm to find a virtual valuation function with the optimal
(additive) rationality guarantee. Moreover, we show that there exists such a
valuation function that both is individually rational and is minimum (that is,
it is component-wise dominated by any other individually rational, virtual
valuation function that approximately fits the data). Similarly, given upper
bound constraints on the valuation function, we show how to fit the maximum
virtual valuation function with the optimal additive rationality guarantee. In
practice, revealed preference bidding constraints are very demanding. We
explain how approximate rationality can be used to create relaxed revealed
preference constraints in an auction. We then show how combinatorial methods
can be used to implement these relaxed constraints. Worst/best-case welfare
guarantees that result from the use of such mechanisms can be quantified via
the minimum/maximum virtual valuation function
Testing Consumer Rationality using Perfect Graphs and Oriented Discs
Given a consumer data-set, the axioms of revealed preference proffer a binary
test for rational behaviour. A natural (non-binary) measure of the degree of
rationality exhibited by the consumer is the minimum number of data points
whose removal induces a rationalisable data-set.We study the computational
complexity of the resultant consumer rationality problem in this paper. This
problem is, in the worst case, equivalent (in terms of approximation) to the
directed feedback vertex set problem. Our main result is to obtain an exact
threshold on the number of commodities that separates easy cases and hard
cases. Specifically, for two-commodity markets the consumer rationality problem
is polynomial time solvable; we prove this via a reduction to the vertex cover
problem on perfect graphs. For three-commodity markets, however, the problem is
NP-complete; we prove thisusing a reduction from planar 3-SAT that is based
upon oriented-disc drawings
Behavioral implications of shortlisting procedures
We consider two-stage “shortlisting procedures” in which the menu of alternatives is first pruned by some process or criterion and then a binary relation is maximized. Given a particular first-stage process, our main result supplies a necessary and sufficient condition for choice data to be consistent with a procedure in the designated class. This result applies to any class of procedures with a certain lattice structure, including the cases of “consideration filters,” “satisficing with salience effects,” and “rational shortlist methods.” The theory avoids background assumptions made for mathematical convenience; in this and other respects following Richter’s classical analysis of preference-maximizing choice in the absence of shortlisting
On the lease rate, convenience yield and speculative effects in the gold futures market
By examining data on the gold forward offered rate (GOFO) and lease rates over the period 1996- 2009, we conclude that the convenience yield of gold is better approximated by the lease rate than the interest-adjusted spread of Fama & French (1983). Using the latter quantity, we study the relationship between gold leasing and the level of COMEX discretionary inventory and exhibit that lease rates are negatively related to inventories. We also show that Futures prices have increasingly exceeded forward prices over the period, and this effect increases with the speculative pressure and the maturity of the contracts
Revealed Preference Dimension via Matrix Sign Rank
Given a data-set of consumer behaviour, the Revealed Preference Graph
succinctly encodes inferred relative preferences between observed outcomes as a
directed graph. Not all graphs can be constructed as revealed preference graphs
when the market dimension is fixed. This paper solves the open problem of
determining exactly which graphs are attainable as revealed preference graphs
in -dimensional markets. This is achieved via an exact characterization
which closely ties the feasibility of the graph to the Matrix Sign Rank of its
signed adjacency matrix. The paper also shows that when the preference
relations form a partially ordered set with order-dimension , the graph is
attainable as a revealed preference graph in a -dimensional market.Comment: Submitted to WINE `1
Consumer choice and revealed bounded rationality
We study two boundedly rational procedures in consumer behavior. We show that these procedures can be detected by conditions on observable demand data of the same type as standard revealed preference axioms. This provides the basis for a non-parametric analysis of boundedly rational consumer behavior mirroring the classical one for utility maximization
- …